Game Semantics for Quantum Stores
نویسندگان
چکیده
منابع مشابه
Game Semantics for Quantum Stores
This paper presents a game semantics for a simply-typed λ-calculus equipped with quantum stores. The quantum stores are equipped with quantum operations as commands which give the language enough expressiveness to encode any quantum circuits. The language uses a notion of extended variable, similar to that seen in functional languages with pattern matching, but adapted to the needs of dealing w...
متن کاملGame Semantics for Quantum Data
This paper presents a game semantics for a simply-typed λ-calculus with qbits constants and associated quantum operations. The resulting language is expressive enough to encode any quantum circuit. The language uses a notion of extended variable, similar to that seen in functional languages with pattern matching, but adapted to the needs of dealing with tensor products. The game semantics is co...
متن کاملA Quantum Game Semantics for the Measurement Calculus
In this paper we present a game semantics for a quantum programming language based on a new definition of quantum strategies. The language studied is MCdata, a typed version of the measurement calculus recently introduced by Danos et. al. We give a soundness and adequacy result based on our quantum game semantics. The main contribution is not the semantics of MCdata but rather the development o...
متن کاملGame semantics for interface
We consider an object calculus in which open terms interact with the environment through interfaces. The calculus is intended to capture the essence of contextual interactions of Middleweight Java code. Using game semantics, we provide fully abstract models for the induced notions of contextual approximation and equivalence. These are the first denotational models of this kind.
متن کاملGame Semantics
ion is modelled by currying: [[ ` x : A:M : A! B]] = ([[ ; x : A `M : B]]) : [[ ]]! [[A]]) [[B]]: The interpretation of application makes use of the evaluation map ev : (A) B) A ! B obtained by uncurrying the identity on A ) B. If ` M : A ! B and ` N : A then [[ `MN ]] = h[[ `M ]]; [[ ` N ]]i # ev: We shall now show how PCF can be interpreted in any of the cartesian closed categories C, Ci, Cb ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.10.010